首页> 外文OA文献 >Prunnig Algorithm of Generation a Minimal Set of Rule Reducts Based on Rough Set Theory
【2h】

Prunnig Algorithm of Generation a Minimal Set of Rule Reducts Based on Rough Set Theory

机译:基于maTLaB的最小规则约简生成的prunnig算法   粗糙集理论

摘要

In this paper it is considered rule reduct generation problem, based on RoughSet Theory. Rule Reduct Generation (RG) and Modified Rule Generation (MRG)algorithms are well-known. Alternative to these algorithms Pruning Algorithm ofGeneration A Minimal Set of Rule Reducts, or briefly Pruning Rule Generation(PRG) algorithm is developed. PRG algorithm uses tree structured data type. PRGalgorithm is compared with RG and MRG algorithms
机译:在本文中,基于粗糙集理论将其视为规则约简生成问题。规则归约生成(RG)和修改规则生成(MRG)算法是众所周知的。替代这些算法生成的修剪算法开发了一套最小的规则约简或简短的修剪规则生成(PRG)算法。 PRG算法使用树状结构的数据类型。 PRGalgorithm与RG和MRG算法进行了比较

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号